منابع مشابه
Dynamic Monopolies of Constant Size
This paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood. (All recolorings are done simultaneously). We say that a set W0 of vertices is a dynamic monopoly or dynamo if starting the game with the vertices ofW0 colored white, the entire system is whi...
متن کاملTight Bounds on the Size of 2-Monopolies
This paper deals with the question of the innuence of a monopoly of vertices, seeking to gain the majority in local neighborhoods in a graph. Say that a vertex v is r-controlled by a set of vertices M if the majority of its neighbors at distance r are from M. We ask how large must M be in order to r-monopolize the graph, namely, r-control every vertex. Tight upper and lower bounds are provided ...
متن کاملDynamic Monopolies with Stochastic Demand
This paper analyzes Perfect Bayesian Equilibria in dynamic monopolies with stochastic demand. It examines sequential take-it-or-leave-it o®ers and sequential auctions. It is shown that equilibria in the former mechanism trade-o® allocative e±ciency and competing buyers' opportunities to acquire an item to be sold, permitting prices and expected revenue above those of one-shot o®ers and sequenti...
متن کاملOn time versus size for monotone dynamic monopolies in regular topologies
We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously recolors itself by the color of the simple (strong) majority of its neighbours. A set of vertices is said to be a dynamo, if starting the game with only the vertices of colored black, the computation eventually reaches...
متن کاملDynamic monopolies with randomized starting configuration
Properties of systems with majority voting rules have been exhaustingly studied. In this work we focus on the randomized case where the system is initialized by randomized initial set of seeds. Our main aim is to give an asymptotic estimate for sampling probability, such that the initial set of seeds is (is not) a dynamic monopoly almost surely. After presenting some trivial examples, we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00043-2